An Efficient Marine Predators Algorithm for Solving Multi-Objective Optimization Problems: Analysis and Validations

نویسندگان

چکیده

Recently, a new strong optimization algorithm called marine predators (MPA) has been proposed for tackling the single-objective problems and could dramatically fulfill good outcomes in comparison to other compared algorithms. Those dramatic outcomes, addition our recently-proposed strategies helping meta-heuristic algorithms fulfilling better multi-objective problems, motivate us make comprehensive study see performance of MPA alone with those problems. Specifically, This paper proposes four variants predators' solving The first version, (MMPA) is based on behavior finding their prey. In second novel strategy dominance strategy-based exploration-exploitation (DSEE) effectively incorporated MMPA relate exploration exploitation phase solutions-this version M-MMPA. DSEE counts number dominated solutions each solution-the high undergo an phase; others small phase. third integrates M-MMPA Gaussian-based mutation, which uses Gaussian distribution-based search optimal solution. fourth Nelder-Mead simplex method (M-MMPA-NMM) at start process construct front non-dominated that will help find more solutions. effectiveness versions validated large set theoretical practical For all cases, its are shown be superior well-known

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Differential Evolution Algorithm for Solving Multi-objective Optimization Problems

This paper presents a modified Differential Evolution (DE) algorithm called OCMODE for solving multi-objective optimization problems. First, the initialization phase is improved by using the opposition based learning. Further, a time varying scale factor F employing chaotic sequence is used which helps to get a well distributed Pareto front by the help of non dominated and crowding distance sor...

متن کامل

An Efficient Conjugate Gradient Algorithm for Unconstrained Optimization Problems

In this paper, an efficient conjugate gradient method for unconstrained optimization is introduced. Parameters of the method are obtained by solving an optimization problem, and using a variant of the modified secant condition. The new conjugate gradient parameter benefits from function information as well as gradient information in each iteration. The proposed method has global convergence und...

متن کامل

Multi-objective Phylogenetic Algorithm: Solving Multi-objective Decomposable Deceptive Problems

In general, Multi-objective Evolutionary Algorithms do not guarantee find solutions in the Pareto-optimal set. We propose a new approach for solving decomposable deceptive multi-objective problems that can find all solutions of the Pareto-optimal set. Basically, the proposed approach starts by decomposing the problem into subproblems and, then, combining the found solutions. The resultant appro...

متن کامل

An Enhanced Annealing Genetic Algorithm For Multi-objective Optimization Problems

In this paper, we present a new algorithm — an Enhanced Annealing Genetic Algorithm for Multi-Objective Optimization problems (MOPs). The algorithm tackles the MOPs by a new quantitative measurement of the Pareto front coverage quality — Coverage Quotient. We then correspondingly design an energy function, a fitness function and a hybridization framework, and manage to achieve both satisfactory...

متن کامل

An efficient approach for solving layout problems

This paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. By this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. This is resulted from dividing area into discrete and continuous dimensions. Also defining decision var...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2021

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2021.3066323